A large neighborhood search approach to the vehicle routing problem with delivery options

To reduce delivery failures in last mile delivery, several types of options have been proposed the past twenty years. Still, customer satisfaction is a challenge because single location chosen independently time at which customer’s order will be delivered. In addition, shared locations such as lockers and shops also experience failure due to capacity or opening-time issues moment delivery. address this issue foster consolidation locations, we investigate case where can specify together with preference levels windows. We define, article, Vehicle Routing Problem Delivery Options, integrates locations. It consists designing set routes for fleet vehicles that deliver each one his/her during corresponding window. These should respect capacities minimum service level requirements, while minimizing total routing costs. This problem solved large neighborhood search partitioning periodically used reassemble routes. Specific ruin recreate operators are combined numerous from literature. A thorough experimental study was carried out determine subset efficient complementary operators. The method outperforms existing algorithms literature on particular cases under consideration, vehicle roaming home New instances generated both serve benchmark propose some managerial insight into alternative options.